Temporal task clustering for online placement on reconfigurable hardware

نویسندگان

  • Ali Ahmadinia
  • Christophe Bobda
  • Jürgen Teich
چکیده

Partial reconfiguration allows for mapping and executing several tasks on an FPGA during run time. One of the challenging problems in multitasking systems is high amount of communication costs. In this paper, we present two clustering methodologies that temporally cluster real-time tasks for a partially reconfigurable hardware and reduce communication overhead. The first algorithm aims at efficient use of resources by clustering close run-time tasks, and the second one makes the clustering with respect to a trade off between inter-task communication and resource utilization efficiency. The results show significant reduction in communication costs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online scheduling and placement of hardware tasks with multiple variants on dynamically reconfigurable field-programmable gate arrays

Hardware task scheduling and placement at runtime plays a crucial role in achieving better system performance by exploring dynamically reconfigurable Field-Programmable Gate Arrays (FPGAs). Although a number of online algorithms have been proposed in the literature, no strategy has been engaged in efficient usage of reconfigurable resources by orchestrating multiple hardware versions of tasks. ...

متن کامل

Survey of Online Hardware Task Scheduling and Placement Algorithms for Partially Reconfigurable Computing Systems

Run time Partially Reconfigurable FPGAs find various applications in the field of Cryptography, Image processing, Network Security, Video streaming etc., because of low power consumption, high density, flexibility and high performance. Further more, the dynamism and true multitasking makes it popular in the area of today’s advanced computing platforms. An powerful operating system is required t...

متن کامل

Online Hardware Task Scheduling and Placement Algorithm on Partially Reconfigurable Devices

In this paper, we propose an online hardware task scheduling and placement algorithm and evaluate it performance. Experimental results on large random task set show that our algorithm outperforms the existing algorithms in terms of reduced total wasted area up to 89.7%, has 1.5 % shorter schedule time and 31.3% faster response time.

متن کامل

Off-Line Placement of Tasks onto Reconfigurable Hardware Considering Geometrical Task Variants

We consider off-line task placement onto reconfigurable hardware devices (RHDs), which are increasingly used in embedded systems. The tasks are modelled as three dimensional boxes given by their footprint times execution time which results into a three dimensional orthogonal packing problem. Unlike other approaches, we allow several alternative implementation variants for each task, which enabl...

متن کامل

Adaptive Free Space Management of Online Placement for Reconfigurable Systems

The FPGA can be reconfigured both dynamically and partially. Such reconfigurable FPGA allows several tasks to be executed, placed and removed at the runtime. Therefore, the hardware resources management in FPGA on the online placement becomes very important. Most techniques for finding empty space are based on rectangle. In this paper, we propose an adaptive free space management for finding ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003